import java.util.ArrayList;
import java.util.List;

public class Test {

    public static void main(String[] args) {

        List<List<Integer>> ret = new ArrayList<>();
        

        BinaryTree btree = new BinaryTree();
        BinaryTree.TreeNode root = btree.createBinaryTree();

        System.out.print("先序遍历：");
        btree.preOrder(root);
        System.out.println("----");
        btree.preOrderNor(root);

        System.out.println();

        System.out.print("中序遍历：");
        btree.inOrder(root);

        System.out.println("----");
        btree.inOrderNor(root);

        System.out.println();

        System.out.print("后序遍历：");
        btree.postOrder(root);

        System.out.println("--------");
        btree.postOrderNor(root);

        System.out.println();
//
//        if(btree.find(root, 4) != null){
//            System.out.println("找到了");
//        }else {
//            System.out.println("找不到");
//        }
//
//        List<List<BinaryTree.TreeNode>> list = btree.leverOrder(root);
//        System.out.println();
//        btree.leverOrder(root);
//
//        System.out.println(btree.isCompleteTree(root));


//        System.out.println();
//
//        System.out.println("树的节点个数："+btree.size(root));
//
//        System.out.println("树的叶子节点个数："+btree.getLeafTreeNodeCount(root));
//
//        System.out.println("第1层的节点个数："+btree.getKLevelTreeNodeCount(root,1));
//        System.out.println("第2层的节点个数："+btree.getKLevelTreeNodeCount(root,2));
//        System.out.println("第3层的节点个数："+btree.getKLevelTreeNodeCount(root,3));
//        System.out.println("第4层的节点个数："+btree.getKLevelTreeNodeCount(root,4));


    }



}

